Chorography Control In Ad Hoc Networks With Cooperative Communications

In this paper, we address the Topology control with Cooperative Communication (TCC) problem in ad hoc wireless network systems. Cooperative communication is a peculiar model introduced recently that allows combining partial messages to decode a full message. The goal of the TCC problem is to gain a strongly-connected topology with minimum total energy consumption. We show TCC problem is NP-complete and design two distributed and localized algorithms to be used by the nodes to set up their communication distance ranges. These two algorithms can be applied on any balanced, strongly-connected topology to minimize total power usage. First algorithm uses a decision distribute process at each node that makes use of only 2hop neighbor information. The second algorithm sets up the transmission ranges of nodes recursively, over a max of six steps, using only 1-hop neighborhood information. We made a graph for the performance of our approaches through extensive